Burg (Peter), Saar-Franzose, Peter/Pierre Lorson SJ.
نویسندگان
چکیده
منابع مشابه
Microsoft Word - ITWSA_gensips2008_huang2-SJ
An algorithm for the discovery of time varying modules using genome-wide expression data is presented here. When applied to large-scale time serious data, our method is designed to discover not only the transcription modules but also their timing information, which is rarely annotated by the existing approaches. Rather than assuming commonly defined time constant transcription modules, a module...
متن کاملThe Burg algorithm for segments
In many applications, the duration of an uninterrupted measurement of a time series is limited. However, it is often possible to obtain several separate segments of data. The estimation of an autoregressive model from this type of data is discussed. A straightforward approach is to take the average of models estimated from each segment separately. In this way, the variance of the estimated para...
متن کاملObservation of the D(sJ)(2317) and D(sJ)(2457) in B decays.
We report the first observation of the B-->Dmacr;D(sJ)(2317) and B-->Dmacr;D(sJ)(2457) decays based on 123.8x10(6) BBmacr; events collected with the Belle detector at KEKB. We observe the D(sJ)(2317) decay to D(s)pi(0) and the D(sJ)(2457) decay to the D(*)(s)pi(0) and D(s)gamma final states. We also set 90% C.L. upper limits for the decays D(sJ)(2317)-->D(*)(s)gamma, D(sJ)(2457)-->D(*)(s)gamma,...
متن کاملOnline Linear Regression using Burg Entropy
We consider the problem of online prediction with a linear model. In contrast to existing work in online regression, which regularizes based on squared loss or KL-divergence, we regularize using divergences arising from the Burg entropy. We demonstrate regret bounds for our resulting online gradient-descent algorithm; to our knowledge, these are the first online bounds involving Burg entropy. W...
متن کاملModified Burg Algorithms for Multivariate Subset Autoregression
Lattice algorithms for estimating the parameters of a multivariate autoregression are generalized to deal with subset models in which some of the coefficient matrices are constrained to be zero. We first establish a recursive prediction-error version of the empirical Yule-Walker equations. The estimated coefficient matrices obtained from these recursions are the coefficients of the best linear ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Revue d’Alsace
سال: 2012
ISSN: 0181-0448,2260-2941
DOI: 10.4000/alsace.1692